Soundness and completeness of the cirquent calculus system CL6 for computability logic
نویسندگان
چکیده
Computability logic is a formal theory of computability. The earlier article “Introduction to cirquent calculus and abstract resource semantics” by Japaridze proved soundness and completeness for the basic fragment CL5 of computability logic. The present article extends that result to the more expressive cirquent calculus system CL6, which is a conservative extension of both CL5 and classical propositional logic.
منابع مشابه
Mathematical Logic The taming of recurrences in computability logic through cirquent calculus, Part II
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦| , and branching corecurrence ◦| . The article is published in two parts, with (the previous) Part I containing prelimin...
متن کاملMathematical Logic The taming of recurrences in computability logic through cirquent calculus, Part I
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦| , and branching corecurrence ◦| . The article is published in two parts, with (the present) Part I containing prelimina...
متن کاملThe taming of recurrences in computability logic through cirquent calculus, Part II
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦ | , and branching corecurrence ◦| . The article is published in two parts, with (the previous) Part I containing prelimi...
متن کاملThe taming of recurrences in computability logic through cirquent calculus, Part I
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ¬, parallel conjunction ∧, parallel disjunction ∨, branching recurrence ◦ | , and branching corecurrence ◦| . The article is published in two parts, with (the present) Part I containing prelimin...
متن کاملIntroduction to Cirquent Calculus and Abstract Resource Semantics
This paper introduces a refinement of the sequent calculus approach called cirquent calculus. Roughly speaking, the difference between the two is that, while in Gentzen-style proof trees sibling (or cousin, etc.) sequents are disjoint and independent sequences of formulas, in cirquent calculus they are permitted to share elements. Explicitly allowing or disallowing shared resources and thus tak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 20 شماره
صفحات -
تاریخ انتشار 2012